† Corresponding author. E-mail:
Project supported by the National Natural Science Foundation of China (Grant Nos. 11572184 and 11562020), the National Basic Research Program of China (Grant No. 2012CB725404), and the Research Foundation of Shanghai Institute of Technology (Grant No. 39120K196008- A06).
We propose an extended cellular automaton model based on the floor field. The floor field can be changed accordingly in the presence of pedestrians. Furthermore, the effects of pedestrians with different speeds are distinguished, i.e., still pedestrians result in more increment of the floor field than moving ones. The improved floor field reflects impact of pedestrians as movable obstacles on evacuation process. The presented model was calibrated by comparing with previous studies. It is shown that this model provides a better description of crowd evacuation both qualitatively and quantitatively. Then we investigated crowd evacuation from a middle-size theater. Four possible designs of aisles in the theater are studied and one of them is the actual design in reality. Numerical simulation shows that the actual design of the theater is reasonable. Then we optimize the position of the side exit in order to reduce the evacuation time. It is shown that the utilization of the two exits at bottom is less than that of the side exits. When the position of the side exit is shifted upwards by about 1.6 m, it is found that the evacuation time reaches its minimum.
There are many events held all over the world where a large number of people gather in a rather small area, such as theaters and gymnasiums. In case of emergency, people should be evacuated safely as soon as possible. Meanwhile, it is well known that some interesting self-organized phenomena occur during evacuation, such as arching and clogging at bottlenecks and the faster-is-slower effect.[1] Therefore, the understanding of crowd evacuation process is very important for both safety and theoretical reasons. Many efforts have been devoted to this issue, including empirical observations, well-controlled experiments, modeling, and simulation.[1,2] In general, microscopic models allow depicting detailed interaction among individuals, therefore they are more elaborate to mimic collective behaviors. Some commonly-used models include the social force model,[3] lattice gas (LG) model,[4] and cellular automata (CA) models.[5] Both LG and CA models are fully discrete which are rule-based, flexible, and of high computation efficiency.
In reality, usually there are kinds of facilities in public areas with complex inner structures. Hence, it is essential for pedestrians to determine the feasible paths to their destinations. The field-based CA models provide a uniform way to solve this problem. The first field-based CA model is the floor field cellular automaton (FFCA) model suggested by Burstedde et al.[6] In the FFCA model, there are two types of floor fields: the static floor field and the dynamic floor field. The static floor field is used to specify regions of space which are more attractive, e.g., an exit or other targets. The static floor field contains the global information of inner structures of the building, and a pedestrian can determine where to go according to local field information. More precisely, the gradient of the static floor field suggests the reasonable moving direction for each pedestrian which indicates the shortest way to the target exit. The dynamic floor field can be used to mimic pedestrians’ following behaviors, which takes effect locally. It is obvious that the static floor field is changed in the presence of obstacles. In most cases, pedestrian facilities (e.g., walls and tables) are static obstacles. Several algorithms have been put forward to deal with crowd evacuation with obstacles.[7,8] As s result, pedestrians’ route-choice behaviors in complex situations seem to coincide qualitatively with our daily experience. Hereafter, the floor field cellular automaton (FFCA) model has been widely extended to simulate pedestrian traffic in various scenarios.[9–15] In the context of CA models, usually the movement of pedestrians is updated simultaneously.[5,6] During evacuation process, conflicts will inevitably occur when two or more pedestrians attempt to enter the same site simultaneously. Generally, conflicts are solved by randomly choosing one of the candidates. While in the LG model, the conflicts are excluded since the random sequential updating is adopted. However, the movement of pedestrians are generally believed in a parallel way. Recently, game theory has been used to deal with conflicts among pedestrians.[16–21] In contrast to a given set of rules in CA models, the local interaction among pedestrians is reflected by the payoff matrix and the possible movement of pedestrians is determined by the related payoffs in game theory. Game theory is also useful for pedestrians to choose their exits during evacuation. In order to get a better understanding of evacuation, some researchers not only performed simulations but also organized experiments on evacuation.[22–28] Most of experiments are of rather small scale, such as evacuation from a classroom. These empirical results can be used to determine model parameters and testify validation of models in use.
The effect of pedestrians on evacuation has been recognized from the very beginning. The typical case is that one of exits is blocked due to overcrowding, some evacuees will try to find another farther but less congested exit. Therefore, the density of crowd at each exit can be served as a criterion for evacuees to choose their target exits. This feature has been considered in previous studies. For example, Yue et al.[29,30] proposed the dynamic parameter (DP) model to simulate pedestrian multi-exit evacuation. The dynamic parameters include direction parameter, empty parameter, and cognition parameter which are formulated to instruct the exit selection of pedestrians. The effect of pedestrian density near exits on the evacuation process was taken into account. As mentioned above, the static floor field will be changed by obstacles. However, pedestrians are not treated as obstacles in most cases. In fact, one often faces that he/she is blocked by others in front. Therefore, pedestrians can also be treated as a kind of movable obstacles.[31] Furthermore, it is evident that still pedestrians have more influence on their followers than moving ones. To the authors’ knowledge, the effect of pedestrians with different speeds has been considered less in previous literatures.
In this paper, we propose an extended cellular automaton model based on our previous work.[31] Because pedestrians are treated as moving obstacles with different speeds, then the static floor fields is no longer static as that in Ref. [5]. At the same time, the confliction factor is introduced to reflect the effect of conflicts among pedestrians who attempt to enter the same cell. The more the confliction factor is, the more difficult pedestrians enter the target cell. Numerical simulations are carried out to validate the presented model. Then we use this model to investigate the optimal design of inner structures and exits in a middle-size theater.
In the proposed model, the space is represented by two-dimensional square grid. The size of each cell is approximately 40 cm × 40 cm which is the typical area occupied by a person in a dense situation.[5] Each cell can be either empty or occupied by exactly one person or by an obstacle. The desired moving direction of each pedestrian is determined by an improved floor field and his/her actual moving direction also depends on interaction with others or obstacles. It is assumed that pedestrians know exactly their own target exits in the building, then they will move towards their destinations directly without the help of others in front. For simplicity, the dynamic floor field is omitted.
Figure
Usually, once the geometry of the room and the location of exits are determined, each cell is assigned a value of the static floor field which represents its distance to the nearest exit. Several effective algorithms have been suggested to give a feasible path in a room with obstacles.[7,8] However, pedestrians can also be viewed as movable obstacles.[31] In this case, the static floor field varies with the movement of pedestrians. Furthermore, moving and still pedestrians are distinguished in this paper, i.e., still pedestrians result in larger increment of the floor field than moving ones. Based on this method suggested by Huang et al.,[8] we take the effect of pedestrians with different speeds into account. The detailed algorithm for the improved floor field is described in the following steps.
The transition probability of a pedestrian at cell (i,j) to his/her neighbouring cell (i′,j′) is determined by the following probability:
Since the movement of pedestrians is updated in parallel, so we must handle the conflicts among pedestrians, i.e., more than one pedestrians want to enter the same cell simultaneously. Suppose there are n persons aiming the same cell, and the confliction factor c is introduced which serves as a measure of panic. The larger the confliction factor is, the more panic pedestrians behave. It is generally believed that pedestrians with more competition will lead to less use of space. It is assumed that none can enter the target cell if r < min (n × c,1). Here r is a uniformly distributed random number and 0 ⩽ r ⩽ 1, otherwise one of them will be chosen to enter the target cell according to the following probabilities. For example, n = 2. Let Q = n × c. The transition probabilities of the two pedestrians are
At each time step, the improved floor field S for all exits are updated with the movement of pedestrians. Then the desired moving direction of each pedestrian is determined by the floor field. If no conflicts, one can enter the target cell. Once a conflict occurs, one of them involved can enter the target cell according to certain probabilities, meanwhile the others keep still. All pedestrians move towards their own exits. Notice that the target exit for a certain pedestrian may be changed due to the varying floor field. Once a pedestrian reaches the exit cell, he/she will be removed from the system immediately. A run of simulation ends when all pedestrians left the room.
Numerical simulations are performed to calibrate the presented model before we investigate the crowd evacuation from a theater in use. Simulation results are compared with those in previous literatures, e.g., Kirchner et al.[9] They introduced a friction parameter μ in the FFCA model which can be interpreted as a kind of an internal local pressure between the pedestrians, especially in regions of high density. The parameter controls the probability that the movement of all pedestrians involved in a conflict is denied at one time step. It is obvious that here the confliction factor c is similar to the friction parameter, but their effects are not exactly the same. In this paper, the probability for a pedestrian to enter a cell depends on both the confliction factor and the number of pedestrians involved in a conflict (see Subsection
Figure
We further investigated the effect of the confliction factor on evacuation from a room with a single exit. The size of the room is 42 × 41 cells where both the length and width of each cell are 0.4 m. There are no obstacles in the room. Initially pedestrians are randomly distributed. The densities of pedestrians are taken as 0.05, 0.1, 0.15, 0.2, 0.25, and 0.3. The exit width w is set as 1, 2, 3, and 4 cells. The confliction factors are set as 0, 0.1, 0.2, and 0.3 which correspond to ideal, normal, critical, and panic states respectively. The data points in Figs.
As shown in Fig.
Then we studied the utilization rate of the exit. The specific flow F is defined as
Evacuation from a room with inner facilities (e.g., classroom) has been investigated by many researchers.[10,23,24] In this paper, we investigated crowd evacuation from a middle-size theater which contains 900 seats. As shown in Fig.
The floor field in Fig.
It is obvious that the arrangement of aisles plays a key role in crowd evacuation. For comparison, we also consider the other three setups of aisles, see Fig.
As shown in Table
The snapshots of pedestrian distribution at t = 60 s are given in Fig.
As we have known, when the number of aisles is more than one and they are distributed properly, there are only negligible difference of the evacuation time between these cases. In order to reduce the evacuation time, it is natural to find the best position of exits. In the original design (Case 0), the horizontal aisle faces the side exits. Such a design is symmetric and pretty. But the position of exits may not the best one from the viewpoint of crowd evacuation. According to the snapshots of pedestrian distribution at t = 90 s (not shown in Subsection
For simplicity, we adopt the arrangement of aisle in Case 0 and hold the position of the two bottom exits unchanged. Then we only shift the position of the two side exits, the position offset of the side exit is represented by d. And d is set to 1, 2, 3, 4, 5, 10, 15, and 20 cells, respectively. In Case 0, d = 0. Numerical results are shown in Table
From the snapshots of evacuation process with different offset d in Fig.
Figure
In this paper, we proposed an extended FFCA model in which the effect of pedestrians is considered. Furthermore, still and moving pedestrians are distinguished. The effect of pedestrians on the floor field is helpful for pedestrians to find a feasible route with less congestion. Then we applied this model to investigate crowd evacuation from a middle-size theater. Our aim is to find the optimal design of the inner structures and exits. It is found that the actual design of the theater is reasonable but not the best one for crowd evacuation. Numerical results show that the side exits should be shifted upwards by four cells. However, it is only a preliminary study of simulation-based optimization on real buildings. It is believed that both numerical simulation and artificial intelligence algorithms may provide a satisfied solution.
[1] | |
[2] | |
[3] | |
[4] | |
[5] | |
[6] | |
[7] | |
[8] | |
[9] | |
[10] | |
[11] | |
[12] | |
[13] | |
[14] | |
[15] | |
[16] | |
[17] | |
[18] | |
[19] | |
[20] | |
[21] | |
[22] | |
[23] | |
[24] | |
[25] | |
[26] | |
[27] | |
[28] | |
[29] | |
[30] | |
[31] |